Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
341	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics
342	CCCG 2009, Vancouver, BC, August 17–19, 2009 How to make a picturesque maze Yoshio Okamoto∗† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:33:29 Mazes Algorithms Spanning tree Puzzles Maze generation algorithm Maze Hamiltonian path NP-complete Maze solving algorithm Graph theory Theoretical computer science Mathematics
343	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
344	Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:54 Network theory NP-complete problems Shortest path problem Steiner tree problem Routing algorithms Graph theory Theoretical computer science Mathematics
345	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
346	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximating Full Steiner Tree in a Unit Disk Graph Ahmad Biniaz∗ Anil Maheshwari∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-18 15:41:52 NP-complete problems Steiner tree problem Spanning tree Tree Graph Graph coloring Matroid theory Quasi-bipartite graph Minimum spanning tree Graph theory Theoretical computer science Mathematics
347	A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-08-05 21:28:00 NP-complete problems Combinatorial optimization 2-satisfiability Independent set Matching Automatic label placement Algorithm Dominating set Partial cube Theoretical computer science Mathematics Graph theory
348	DEPARTAMENTO DE COMPUTACION Facultad de Ciencias Exactas y Naturales - UBA Universidad de Buenos Aires Facultad de Ciencias Exactas y Naturales Add to Reading List Source URL: dc.uba.ar Language: English - Date: 2013-03-19 08:15:12 Morphisms NP-complete problems Graph operations Graph isomorphism Combinatorial optimization Graph Bipartite graph Cograph Tree Graph theory Mathematics Theoretical computer science
349	CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:32:58 NP-complete problems Delaunay triangulation Triangulation Maximum flow problem Cut Shortest path problem Graph theory Mathematics Theoretical computer science
350	Learning Attack Strategies from Intrusion Alerts ∗ Peng Ning Add to Reading List Source URL: discovery.csc.ncsu.edu Language: English - Date: 2011-11-09 13:26:02 NP-complete problems Morphisms Alert correlation Graph isomorphism Subgraph isomorphism problem Matching Tree Mathematics Theoretical computer science Graph theory

UPDATE